Residual iterative schemes for large-scale nonsymmetric positive definite linear systems
نویسندگان
چکیده
منابع مشابه
Residual iterative schemes for large-scale nonsymmetric positive definite linear systems
A new iterative scheme that uses the residual vector as search direction is proposed and analyzed for solving large-scale nonsymmetric linear systems, whose matrix has a positive (or negative) definite symmetric part. It is closely related to Richardson’s method, although the stepsize and some other new features are inspired by the success of recently proposed residual methods for nonlinear sys...
متن کاملPositive Definite and Semi-definite Splitting Methods for Non-hermitian Positive Definite Linear Systems
In this paper, we further generalize the technique for constructing the normal (or positive definite) and skew-Hermitian splitting iteration method for solving large sparse nonHermitian positive definite system of linear equations. By introducing a new splitting, we establish a class of efficient iteration methods, called positive definite and semi-definite splitting (PPS) methods, and prove th...
متن کاملOn Squaring Krylov Subspace Iterative Methods for Nonsymmetric Linear Systems
The Biorthogonal Lanczos and the Biconjugate Gradients methods have been proposed as iterative methods to approximate the solution of nonsymmetric and indefinite linear systems. Sonneveld [19] obtained the Conjugate Gradient Squared by squaring the matrix polynomials of the Biconjugate Gra dients method. Here we square the Biorthogonal Lanczos, the Biconjugate Residual and the Biconjugate Orth...
متن کاملApproximate Inverse Preconditioning of Iterative Methods for Nonsymmetric Linear Systems
A method for computing an incomplete factorization of the inverse of a nonsymmetric matrix A is presented. The resulting factorized sparse approximate inverse is used as a preconditioner in the iterative solution of Ax = b by Krylov subspace methods. 1. Introduction. We describe a method for computing an incomplete factorization of the inverse of a general sparse matrix A 2 IR nn. The resulting...
متن کاملFast secant methods for the iterative solution of large nonsymmetric linear systems
A family of secant methods based on general rank-1 updates has been revisited in view of the construction of iterative solvers for large non-Hermitian linear systems. As it turns out, both Broy-den's "good" and "bad" update techniques play a special role — but should be associated with two different line search principles. For Broyden's "bad" update technique, a minimum residual principle is na...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational & Applied Mathematics
سال: 2008
ISSN: 0101-8205
DOI: 10.1590/s0101-82052008000200003